Comparisons of Parikh's Condition to Other Conditions for Context-free Languages
نویسندگان
چکیده
In this paper we first compare Parikh’s condition to various pumping conditions ~ BarHillel’s pumping lemma, Ogden’s condition and Bader-Moura’s condition; secondly, to interchange condition; and finally, to Sokolowski’s and Grant“s conditions. In order to carry out these comparisons we present some properties of Parikh’s languages. The main result is the orthogonality of the previously mentioned conditions and Parikh’s condition.
منابع مشابه
A Fully Equational Proof of Parikh's Theorem
We show that the validity of Parikh’s theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of μ-term equations of continuous commutative idempotent semirings. AMS Subject Classification (2000): 03C05, 16Y60, 68Q42, 68Q45, 68Q70.
متن کاملParikh's Theorem and Descriptional Complexity
This thesis was carried out in the Laboratorio di Linguaggi e Combinatoria (LIN.COM), at the Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano. The thesis deals with some topics in the theory of formal languages, and specifically with the theory of context-free languages and the study of theirs descriptional complexity. The descriptional complexity of a formal struct...
متن کاملA Brief History of Strahler Numbers — with a Preface
The Strahler number or Horton-Strahler number of a tree, originally introduced in geophysics, has a surprisingly rich theory. We sketch some milestones in its history, and its connection to arithmetic expressions, graph traversing, decision problems for context-free languages, Parikh’s theorem, and Newton’s procedure for approximating zeros of differentiable functions.
متن کاملRegularity of non context-free languages over a singleton terminal alphabet
It is well-known that: (i) every context-free language over a singleton terminal alphabet is regular [4], and (ii) the class of languages that satisfy the Pumping Lemma is a proper super-class of the context-free languages. We show that any language in this super-class over a singleton terminal alphabet is regular. Our proof is based on a transformational approach and does not rely on Parikh’s ...
متن کاملExtending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic right-linear co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 202 شماره
صفحات -
تاریخ انتشار 1998